Every rayless graph has an unfriendly partition
نویسندگان
چکیده
منابع مشابه
Every rayless graph has an unfriendly partition
We prove that every rayless graph has an unfriendly partition.
متن کاملUnfriendly partitions of a graph
It has been conjectured by Cowan and Emerson [3] that every graph has an unfriendly partition; i.e., there is a partition of the vertex set V= V, v V, such that every vertex of V, is joined to at least as many vertices in V, _, as to vertices in V,. It is easily seen that every rinite graph has such a partition, and hence by compactness so does any locally finite graph. We show that the conject...
متن کاملEvery Graph Has an Embedding in S3 Containing No Non-hyperbolic Knot
In contrast with knots, whose properties depend only on their extrinsic topology in S3, there is a rich interplay between the intrinsic structure of a graph and the extrinsic topology of all embeddings of the graph in S3. For example, it was shown by Conway and Gordon that every embedding of the complete graph K7 in S3 contains a non-trivial knot. Later it was shown that for every m ∈ N there i...
متن کاملEvery 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring
Chen, Lih, and Wu conjectured that for r ≥ 3, the only connected graphs with maximum degree at most r that are not equitably r-colorable are Kr,r (for odd r) and Kr+1. If true, this would be a joint strengthening of the Hajnal-Szemerédi Theorem and Brooks' Theorem. Chen, Lih, and Wu proved that their conjecture holds for r = 3. In this paper we study properties of the hypothetical minimum count...
متن کاملEvery plane graph of maximum degree 8 has an edge-face 9-colouring
An edge-face colouring of a plane graph with edge set E and face set F is a colouring of the elements of E ∪ F such that adjacent or incident elements receive different colours. Borodin proved that every plane graph of maximum degree ∆ > 10 can be edge-face coloured with ∆ + 1 colours. Borodin’s bound was recently extended to the case where ∆ = 9. In this paper we extend it to the case ∆ = 8.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2009
ISSN: 1571-0653
DOI: 10.1016/j.endm.2009.07.045